Unique Prime Cartesian Factorization of Graphs Over Finite Fields
نویسندگان
چکیده
منابع مشابه
Unique Prime Cartesian Factorization of Graphs over Finite Fields
A fundamental result, due to Sabidussi and Vizing, states that every connected graph has a unique prime factorization relative to the Cartesian product; but disconnected graphs are not uniquely prime factorable. This paper describes a system of modular arithmetic on graphs under which both connected and disconnected graphs have unique prime Cartesian factorizations.
متن کاملStructure of finite wavelet frames over prime fields
This article presents a systematic study for structure of finite wavelet frames over prime fields. Let $p$ be a positive prime integer and $mathbb{W}_p$ be the finite wavelet group over the prime field $mathbb{Z}_p$. We study theoretical frame aspects of finite wavelet systems generated by subgroups of the finite wavelet group $mathbb{W}_p$.
متن کاملGalois Towers over Non-prime Finite Fields
In this paper we construct Galois towers with good asymptotic properties over any nonprime finite field F`; i.e., we construct sequences of function fields N = (N1 ⊂ N2 ⊂ · · · ) over F` of increasing genus, such that all the extensions Ni/N1 are Galois extensions and the number of rational places of these function fields grows linearly with the genus. The limits of the towers satisfy the same ...
متن کاملstructure of finite wavelet frames over prime fields
this article presents a systematic study for structure of finite wavelet frames over prime fields. let $p$ be a positive prime integer and $mathbb{w}_p$ be the finite wavelet group over the prime field $mathbb{z}_p$. we study theoretical frame aspects of finite wavelet systems generated by subgroups of the finite wavelet group $mathbb{w}_p$.
متن کاملEfficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. Most of the improvements presented here are incorporated in Maple V Release 4. In particular, we show that we needed a general to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Missouri Journal of Mathematical Sciences
سال: 2009
ISSN: 0899-6180
DOI: 10.35834/mjms/1316024880